Explicit canonical methods for Hamiltonian systems
نویسندگان
چکیده
منابع مشابه
Explicit Canonical Methods for Hamiltonian Systems
We consider canonical partitioned Runge-Kutta methods for separable Hamiltonians H = T(ß) + Viq) and canonical Runge-Kutta-Nyström methods for Hamiltonians of the form H = ^pTM~lp + Viq) with M a diagonal matrix. We show that for explicit methods there is great simplification in their structure. Canonical methods of orders one through four are constructed. Numerical experiments indicate the sui...
متن کاملCanonical maps near separatrix in Hamiltonian systems.
A systematic and rigorous method to construct symplectic maps near separatrix of generic Hamiltonian systems subjected to time-periodic perturbations is developed. It is based on the method of canonical transformation of variables to construct Hamiltonian maps [J. Phys. A 35, 2811 (2002)]]. Using canonical transformation of variables and the first-order approximation for the generating function...
متن کاملOn Higher-order Semi-explicit Symplectic Partitioned Runge-kutta Methods for Constrained Hamiltonian Systems
In this paper we generalize the class of explicit partitioned Runge-Kutta (PRK) methods for separable Hamiltonian systems to systems with holonomic constraints. For a convenient analysis of such schemes, we rst generalize the backward error analysis for systems in I R m to systems on manifolds embedded in I R m. By applying this analysis to constrained PRK methods, we prove that such methods wi...
متن کاملExplicit Adaptive Symplectic Integrators for solving Hamiltonian Systems
We consider Sundman and Poincaré transformations for the long-time numerical integration of Hamiltonian systems whose evolution occurs at different time scales. The transformed systems are numerically integrated using explicit symplectic methods. The schemes we consider are explicit symplectic methods with adaptive time steps and they generalise other methods from the literature, while exhibiti...
متن کاملSymmetric multistep methods for constrained Hamiltonian systems
A method of choice for the long-time integration of constrained Hamiltonians systems is the Rattle algorithm. It is symmetric, symplectic, and nearly preserves the Hamiltonian, but it is only of order two and thus not efficient for high accuracy requirements. In this article we prove that certain symmetric linear multistep methods have the same qualitative behavior and can achieve an arbitraril...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1992
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1992-1136225-3